Adaptive joint source channel coding

ABSTRACT

Adaptive joint source channel coding associates multiple predictors with a reference data unit, such as a macroblock or frame of video data. An encoder determines a sub-codebook in which each of the selected multiple predictors decodes to the reference data unit. An identifier for the sub-codebook is transmitted through a channel to a decoder for subsequent decoding of the reference data unit. The reference data unit itself does not need to be sent. The multiple predictors are contained within a decoding region and the identifier for the sub-codebook specifies the decoding region. The decoder uses the identified sub-codebook and one of the predictors to decode the reference data unit. If none of the original predictors are correctly received, different types of error handling are employed based on the type of channel.

RELATED APPLICATIONS

This application is related to and claims the benefit of U.S.Provisional Patent application 60/482,967 filed Jun. 26, 2003, and60/514,350 filed Oct. 24, 2003, which are hereby incorporated byreference.

FIELD OF THE INVENTION

This invention relates generally to encoding and decoding of correlateddata, and more particularly to the use of channel coding for bothcompression and resiliency.

COPYRIGHT NOTICE/PERMISSION

A portion of the disclosure of this patent document contains materialwhich is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by anyone of the patent documentor the patent disclosure as it appears in the Patent and TrademarkOffice patent file or records, but otherwise reserves all copyrightrights whatsoever. The following notice applies to the software and dataas described below and in the drawings hereto: Copyright© 2003, SonyCorporation Inc., All Rights Reserved.

BACKGROUND OF THE INVENTION

A well-known problem that exists for transmitting compressed correlateddata, such as video, over a noisy channel is drift or error propagation.Using video as an example, in the traditional coding paradigm, the firstframe of video is encoded independently and successive video frames areencoded by taking the difference between the current and the immediatelypreceding frames. This source coding reduces the number of bits requiredto transmit the video but the loss or corruption of a single frame cancause errors to be propagated to many successive frames. Channel codingis frequently used to reduce the magnitude of source coding errors byintroducing redundancy into the transmitted data.

A video frame is defined to be an m×n array of values where m and n aredimensions of the video frame and each value is denoted as acoefficient. A macroblock is defined to be a subset of the video frameand can consist of any number of coefficients, from one value to thewhole set of m×n values defined to be the video frame. Furthermore thesubset of coefficients that constitute the macroblock may be operated onby a mathematical transformation to result in a new set of coefficients,as long as the mathematical transformation is invertible so that theoriginal set of coefficients may be recovered. In this invention, theterm macroblock will be used to refer to either the original ortransformed coefficients. Referring to FIG. 1, the macroblock, can bevisualized as a point in an n-dimensional coefficient space, in thiscase a three-dimensional space. The difference 111, often referred to asa “residual” or “residual error,” between the coefficients of areference macroblock 107 and a closely correlated predictor macroblock109 is encoded and sent with the predictor macroblock from an encoder101 to a decoder 105. If the predictor macroblock 109 is lost orcorrupted in a communication channel 103, and the encoded residual error111 is not lost then the decoder 105 can first perform error concealmentby attempting to determine an estimate of the lost predictor macroblock113 and then add the residual error 111 to the estimated predictormacroblock to obtain an estimate of the reference macroblock 115.Because the estimated predictor 113 is unlikely to be identical to theoriginal predictor 109, there will be a difference 117 between thereference macroblock 107 and the reconstructed reference macroblock 115.This difference, or drift error, will then be propagated to successiveframes.

SUMMARY OF THE INVENTION

Adaptive joint source channel coding associates multiple predictors witha reference data unit, such as a macroblock or frame of video data. Anencoder determines a sub-codebook in which each of the selected multiplepredictors decodes to the reference data unit. An identifier for thesub-codebook is transmitted through a channel to a decoder forsubsequent decoding of the reference data unit. The reference data unititself does not need to be sent. The multiple predictors are containedwithin a decoding region and the identifier for the sub-codebookspecifies the decoding region. The decoder uses the identifiedsub-codebook and one of the predictors to decode the reference dataunit. If none of the original predictors are correctly received,different types of error handling are employed based on the type ofchannel.

The present invention is described in conjunction with systems, clients,servers, methods, and machine-readable media of varying scope. Inaddition to the aspects of the present invention described in thissummary, further aspects of the invention will become apparent byreference to the drawings and by reading the detailed description thatfollows.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating prior art coding and decoding withtransmission errors;

FIG. 2A is a diagram illustrating a system-level overview of anembodiment of the invention;

FIG. 2B is a diagram illustrating an alternate embodiment of theinvention;

FIG. 3 is a diagram illustrating an embodiment of a code constructionfor use with the invention;

FIGS. 4A-B are flow diagrams of methods to be performed to encode anddecode data according to an embodiment of the invention;

FIGS. 5A-B are diagrams of contrasting the prior art and an embodimentof the invention implemented for a lossy channel;

FIGS. 6A-B are diagrams contrasting the prior art and an embodiment ofthe invention implemented for bit-rate switching and SNR scalability.

FIG. 7A-B are diagrams contrasting the prior art and an embodiment ofthe invention implemented for spatially scalable coding;

FIG. 8 is a diagram illustrating an embodiment of the inventionimplemented for temporal scalable coding;

FIG. 9 is a diagram illustrating of an embodiment of the inventionimplemented for random access;

FIG. 10 is a diagram illustrating an embodiment of the inventionimplemented in a lifting scheme;

FIG. 11A is a diagram of one embodiment of an operating environmentsuitable for practicing the present invention; and

FIG. 11B is a diagram of one embodiment of a computer system suitablefor use in the operating environment of FIG. 11A.

DETAILED DESCRIPTION OF THE INVENTION

In the following detailed description of embodiments of the invention,reference is made to the accompanying drawings in which like referencesindicate similar elements, and in which is shown by way of illustrationspecific embodiments in which the invention may be practiced. Theseembodiments are described in sufficient detail to enable those skilledin the art to practice the invention, and it is to be understood thatother embodiments may be utilized and that logical, mechanical,electrical, functional, and other changes may be made without departingfrom the scope of the present invention. The following detaileddescription is, therefore, not to be taken in a limiting sense, and thescope of the present invention is defined only by the appended claims.

A system level overview of the operation of an embodiment of encodingand decoding according to the present invention is described withreference to FIG. 2A. The encoding and decoding may be applied to anytype of correlated data, such as moving images and audio, and operateson units of correlated data, such as frames or macroblocks of a videostream. For clarity, embodiments of the invention are generallydescribed in conjunction with video macroblocks but the encoding anddecoding operations are equally applicable to other data units and typesof correlated data. A reference data unit depends on several precedingdata units (“predictors”) so that only one of the predictors need bereceived without error to correctly decode the reference data unit. Thelocation of the multiple predictors 209, 211, 213, 215 within ann-dimensional coordinate space defines a decoding region, shown assphere 219, with a reference macroblock 207 at the center. The radius217 of the decoding sphere is encoded at the encoder 201 instead of theresidual of each predictor. In one embodiment, the radius 217 is encodedby partitioning a codebook to produce a sub-codebook with a granularitythat causes each predictor 209, 211, 213, 215 within the decoding sphere219 to decode to the reference macroblock 207. An identifier for thesub-codebook is sent to the decoder 205 as the encoded value for theradius 217. Even if the best predictor 209 is lost or corrupted in thechannel, 203, the decoder 205 can use the sub-codebook and any one ofthe received predictors, e.g. 211, 213, that fall within the decodingsphere 219 to reconstruct to the reference macroblock 207.

If all of the predictors 209, 211, 213, 215 are lost, the decoder 205can perform error concealment by forming an estimate for the lostpredictors and use a weighted combination of the estimates as thepredictor. If enough redundancy is available in the encoded stream, acorrect decoding can be achieved if the estimated predictor falls withinthe decoding region.

Postprocessing can be performed on the reconstructed frames. If Xrepresents the macroblock to be encoded and Y_(i) represents the i^(th)predictor, then the reconstructed value can be improved by estimating itas:X′=E[X|Y ₁ , Y ₂ , . . . , Y _(n)]  (1)A closed form solution may be attained for the reconstruction assuming astatistical distribution on X and Y₁, Y₂, . . . , Y_(n).

If feedback is available about the channel 203, both the encoder 201 anddecoder 205 can maintain the state of decoding, and the encoder 201 canchoose to use predictors that it knows the decoder 205 has received.Furthermore, the encoder 201 does not need to retransmit an entireidentifier to specify an additional, new predictor but only needs totransmit a supplemental identifier to expand the decoding sphere 219 toinclude the new predictor. As an example, assume that X can be recoveredfrom three predictors, Y₁, Y₂ and Y₃, that all three predictors arelost, and that the decoder has received the identifier for thesub-codebook that includes Y₁, Y₂ and Y₃. After the encoder learns fromthe decoder that all three predictors are lost, the encoder does notneed to send the entire identifier that specifies the sub-codebooknecessary to recover X from a fourth predictor, Y₄, but only needs toexpand the identifier so that the decoding region encompasses Y₄.Non-real time video transmission for feedback channels can benefit fromthis embodiment.

In addition to providing resiliency, it will be appreciated that datacan be compressed by sending the codebook identifier that specifies adecoding region instead of the difference between macroblocks. Using theidentifier for the decoding region to provide both compression andresiliency requires a tradeoff between the two. As illustrated in FIG.2B, for reference macroblock 207, the decoding sphere 221 having radius223 encompasses only the best predictor 209. Since the best predictor209 is most closely correlated with the reference macroblock, thegranularity of the codebook will be finer and thus the compression willbe greater but will provide little resiliency. On the other hand, adecoding sphere 219 having radius 217 encompasses the second 211, third213 and fourth 215 best predictors in addition to the best predictor209, and therefore requires a coarser granularity codebook, resulting inless compression while providing greater resiliency. Thus, theidentifier serves a dual function. First, the identifier is used as thecompressed representation of the reference macroblock. Second, theidentifier is used by the decoder to identify a decoding region, whereany predictor that falls within the decoding region can be used tocorrectly decode the reference macroblock. This allows for robustness,because only one predictor that falls within the decoding region needsto be present at the decoder in order for the reference macroblock to becorrectly decoded.

In one embodiment, the appropriate decoding region is selected bydetermining the maximum expected error. Assuming three predictors, Y₁,Y₂, and Y₃, for a given reference macroblock X_(i), thenY_(1,i)=X_(i)+e_(1,i), Y₂=X_(i)+e_(2,i), and Y₃=X_(i)+e_(3,i). Thecorresponding maximum error ismax_(j)(|e_(j,i)|)  (2)The encoder sends the identifier of a sub-codebook that correctlydecodes any predictor within the maximum error to the referencemacroblock.

In the case where the statistics of the channel error characteristicsare known, the number of bits that are transmitted onto the channel maybe minimized by selecting the optimal mode for each macroblock. Theproblem can be posed as minimizing the expected distortion given arate-constraint R and channel error statistics. This constrainedoptimization problem can be solved by minimizing the lagrangian:J=E[D]+λR  (3)where E[D] is the expected distortion with respect to the channel errorstatistics. The optimal mode is the mode that minimizes the lagrangian:Optimal mode=argmin_(i)(E[D _(i) ]+λR _(i))  (4)where i represents the available encoding modes. In one embodiment, theavailable modes include the traditional intra-frame, inter-frame,forward error correction (FEC) modes, and the joint source channel (JSC)coding mode of the present invention. The expected distortion can becalculated analytically or empirically by simulating channel loss duringthe process of coding the data.

In one embodiment, the codebook is based on lattice partitions, shown asa hierarchical tree 300 in FIG. 3. At the root level, or node, 301, thespacing, or step size, between codepoints is Δ, and at each subsequentlevel i, or leaf node, the spacing is 2^(i)Δ. The root node 301 is usedto perform quantization on the coefficients of the reference macroblockand the leaf nodes 303, 305, 307, 309, 311, 313 are used to channeldecode the multiple predictors to the codepoint that represents thequantized value of the reference macroblock. The bits that specify thepath to the particular leaf node in the tree are used as the identifierfor the decoding region that includes all the predictors. The pathshould be such that the leaf node contains the quantized value that isspecified by the root node. Referring to FIG. 3 and using a singlepredictor for clarity, assume a coefficient X=−2.8 for a referencemacroblock and the corresponding coefficient Y=−0.2 for the bestpredictor macroblock. Assuming Δ=1.5, with codepoints ranging from −7.5to +4.5, the value of the closest codepoint to X at the root level 301is −3, which corresponds to codepoint 3. The closest codepoint to Y atthe root level is 0, which corresponds to codepoint 5. The sub-codebookat leaf node 313 will decode Y to the quantized value of X, i.e., −3,and the bits (11) that specify the path from the root node 301 to leafnode 313, illustrated by the darker arrows in FIG. 3, are used as theencoded value for the radius of the decoding sphere.

Prefix coding is combined with the structure of FIG. 3 so that avariable number of levels can be used in the encoding and a uniquelydecodable sequence can be achieved. In one embodiment, an identifierwill be specified as N ones (or zeros) followed by a zero (or a one) andthe bits that specify the path in the tree. The value of N may representthe number of levels used but can also be tuned to optimize therate-distortion performance. This type of prefix coding is similar toGolomb coding.

As an example, assume the coefficient, X=0.1, in a macroblock is to beencoded. Assuming the step size at the root level is 0.5, X will bequantized to the codepoint that corresponds to zero. All of the possiblepredictors from various macroblocks in the previous frames aredetermined and one or more decoding spheres defined. Assuming a decodingregion that encompasses three predictors, Y₁=0.3, Y₂=0.5 and Y₃=1.2, asub-codebook is selected in which the value for all three of thepredictors fall within the decoding range of zero, i.e., the quantizedvalue of X. Therefore, a step size of 4 at the leaf node, or threelevels, is required for all three predictors to decode to zero. Theencoded value of the decoding sphere radius might be 1110000, where 111instructs the decoder to decode on the third level, and 000 instructsthe decoder to use the codebook at location 000 in the tree. In general,if a step size of 2^(i)Δ is needed, where Δ represents the step size inthe root codebook, then i levels will be needed. In addition, it shouldbe noted that even if only a step size of 2^(i)Δ is needed, one mightchoose to use a step size of 2^(i+1)Δ instead so that an identifier doesnot need to be allocated for the level containing the spacing of 2^(i)Δ.For example, if one chooses not to code the first level, then theidentifiers will be:

-   -   0—no coding necessary (i.e., use 0-level for decoding)    -   1000    -   1001    -   1010    -   1011    -   110000    -   110001    -   110010    -   . . .        so that all predictors that are within 2Δ of the quantized value        will use the second level for decoding. This leads to one less        prefix bit to code the second level versus using N (where N        represents the number of levels) bits to specify the level.        Therefore the expected number of bits to be used can be        minimized based on the probability distribution of the        correlation noise between the predictors and the quantized        value. While adaptive joint source channel coding has been        described as using predictors selected from prior frames, one of        skill in the art will recognize that future frames can be used        as one or more of the predictors. In this case additional        predictors can be garnered from future frames, and the encoder        and decoder will maintain the aforementioned functionality.        Furthermore, spheres have been used as examples of        multi-dimensional decoding regions but the use of other        multi-dimensional shapes is considered within the scope of the        invention.

One embodiment of an adaptive joint source channel encoding method 400to be performed by an encoder, such as encoder 201 of FIG. 2A, isdescribed with reference to a flow diagram shown in FIG. 4A. Acorresponding decoding method 430 to be performed by a decoder, such asdecoder 205 of FIG. 2A, is described with reference to a flow diagramshown in FIG. 4B.

Referring first to FIG. 4A, the adaptive joint source channel encodingmethod 400 selects the predictors for the current reference macroblockfrom previously sent macroblocks (block 401). As described above,selecting more predictors will provide more resiliency but lesscompression than selecting fewer, so the selection at block 401 is basedon various factors that determine whether compression or resiliency ismore important for the channel. An agreed-upon codebook is partitioneduntil a sub-codebook is created that has a decoding region that mapseach of the predictor coefficients to the same value that each of thecoefficients of the reference macroblock is mapped to in the rootcodebook (block 403). The identifier for the appropriate sub-codebook issent to the decoder (block 405). If multiple predictors have beenselected (block 407), the identifier is also the compressedrepresentation of the reference macroblock so no additional informationmust be sent to the decoder. If only a single predictor is within thedecoding region and the identifier is not the compressed representation(block 409), the reference macroblock is encoded and sent to the decoderat block 411. In an alternate embodiment for a feedback channel, theencoding method 400 monitors the state of the decoder (block 413) andselects at least one additional predictor at block 417 if all thepreviously selected predictors have been lost or corrupted (block 415).The encoding method 400 determines a new sub-codebook that contains theadditional identifier (block 419) and sends an additional identifier forthe new sub-codebook to the decoder (block 421). As described above, theadditional identifier may be a supplemental identifier that combineswith the identifier for the previously selected predictors, or it may bethe entire identifier for a different sub-codebook.

Turning now to FIG. 4B, the decoding method 430 is invoked when eitherthe reference macroblock is lost or corrupted or when the identifier isused as the compressed representation of the reference macroblock.Assuming at least one predictor is received correctly (block 431),decoding method 430 determines the correct sub-codebook using thereceived identifier (block 439) and uses it to decode the predictor tothe value of the reference macroblock (block 441). If all the predictorshave been lost or corrupted and the channel is not a feedback channel(block 433), the decoding method 430 estimates the values of thelost/corrupted predictors (block 435) and uses a weighted combination ofthe estimated values as the predictor value (block 437) as describedabove. In an alternate embodiment for a feedback channel, the encoderwill receive an additional identifier from the encoder (block 443),which enlarges the decoding region and determines the correctsub-codebook at block 439. As noted above, the additional identifier maybe a supplemental identifier or an entire identifier.

It will be appreciated that the determination that a reference orpredictor macroblock is lost or corrupted may be made according to anywell-known methodology. In one embodiment, when the stream ofmacroblocks is represented by a codeword created using arithmeticcoding, a forbidden symbol is used to detect errors. The forbiddensymbol will never be encoded, so if the decoder detects the forbiddensymbol in the stream, the decoder recognizes there has been an error. Asdescribed in co-pending U.S. patent application Ser. No. 10/______,which is co-filed with, and assigned to the same assignees, as thepresent application, given a probability of ε that the forbidden symbolwill occur within the stream, the decoding time between the occurrenceof the error and the decoding of the forbidden symbol on average is 1/ε.Thus, if the decoder decodes the forbidden symbol, the previous 1/ε bitsare likely to be corrupted and the decoder can proceed with recoveringthe reference macroblock as described above.

In practice, the methods described herein may constitute one or moreprograms made up of machine-executable instructions. Describing themethod with reference to the flow diagrams in FIGS. 4A-B enables oneskilled in the art to develop such programs, including such instructionsto carry out the operations (acts) represented by the logical blocks onsuitably configured machines (the processor of the machine executing theinstructions from machine-readable media). The machine-executableinstructions may be written in a computer programming language or may beembodied in firmware logic or in hardware circuitry. If written in aprogramming language conforming to a recognized standard, suchinstructions can be executed on a variety of hardware platforms and forinterface to a variety of operating systems. In addition, the presentinvention is not described with reference to any particular programminglanguage. It will be appreciated that a variety of programming languagesmay be used to implement the teachings of the invention as describedherein. Furthermore, it is common in the art to speak of software, inone form or another (e.g., program, procedure, process, application,module, logic . . . ), as taking an action or causing a result. Suchexpressions are merely a shorthand way of saying that execution of thesoftware by a machine causes the processor of the machine to perform anaction or produce a result. It will be further appreciated that more orfewer processes may be incorporated into the methods illustrated inFIGS. 4A-B without departing from the scope of the invention and that noparticular order is implied by the arrangement of blocks shown anddescribed herein.

Particular implementations of the invention are now described inconjunction with FIGS. 5A-B, 6A-B, 7A-B, 8, 9 and 10.

FIG. 5A illustrates the transmission of frames from a prior art encoder501 through an erasure channel 503, such as the Internet, to a decoder505. Assuming that frame 2 depends on frame 1, if frame 1 is lost orcorrupted, frame 2 cannot be decoded. In contrast, FIG. 5B illustratesthe transmission of frames from a encoder 507 that incorporates theadaptive joint source channel coding of the present invention. If frame1 is lost or corrupted in the erasure channel 503, the correspondingdecoder 509 can use frame 0 to decode frame 2.

FIG. 6A illustrates the prior art process of switching between videostreams having different bit rates. In general, the subsequent frames ina stream are only dependent upon prior frames in the same stream, e.g.in stream 601, frame 607 depends on frame 605 while in stream 603, frame611 depends on frame 609. In order to enable a frame in one stream to bereconstructed from a frame in a different stream, special switch picture(SP) points must be defined for the decoder to be able to decode theswitched stream. As shown, frame 607 is defined as a primary SP that canbe recreated from secondary SP 613, which is itself dependent upon frame609 in stream 603, if frame 605 is lost or corrupted. Note that theswitching is only from stream 603 to stream 601; the inverse is notsupported.

In contrast, FIG. 6B illustrates the switching between streams 615, 617when the encoder/decoder incorporates the adaptive joint source channelcoding of the present invention. Because the decoder works with multiplereceived predictors, no switch picture points are required. Whenswitching from a higher to a lower rate stream, the result appears tothe decoder as if some of the predictors have been lost. Furthermore,the switching can occur from stream 615 to 617 as well as from stream617 to stream 615.

In an alternate implementation, assume streams 615, 617 represent oddand even frames being sent through different transmission paths. If oneof the transmission paths fails, those frames can be recovered from theother stream.

FIGS. 7A-B illustrate the difference between scalability in the priorart and in accordance with adaptive joint source channel coding of thepresent invention. Previously, a finer granularity stream 703 could becreated from a base stream 701 to provide SNR scalability. However, eachframe in the stream 701 depended only upon a previous frame in thestream 701 to prevent drift. Furthermore, each frame in stream 703depended from a single frame in the stream 701, and there was nointerdependency among the frames in stream 703. As shown in FIG. 7B,incorporating adaptive source channel coding allows the frames in stream705 to depend from both the base stream 701 and previous frames instream 705. In addition, the frames in base stream 701 can depend uponthe frames in stream 705. A further enhancement stream 707 can becreated from stream 705, and the frames in stream 705 can be dependentupon those in stream 707 as well as the frames in base stream 701 toprovide spatial scalability. For example, stream 705 may be a lowresolution stream suitable for cell phones, while stream 707 may be ahigh resolution stream suitable for television. Thus, once a stream of aparticular resolution has been encoded, a stream of a higher resolutioncan up-sampled from it. The tree structure codebook of FIG. 3 can beused to encode at a given SNR/spatial resolution by starting at thelevel that meets the scaling requirements and moving down the tree. Moreidentifier bits allows for a coarser prediction, while refinementinformation can be sent by specifying bits to refine the value of thequantized coefficients.

FIG. 8 illustrates how the adaptive joint source channel coding may beimplemented with I and P video frames to provide temporal scalability.As known in the art, infra or I-frames contain all the data for aparticular frame while P-frames are predicted from previous frames. Asshown, a first prediction path extends from I-frame 801 to P-frame 803,from P-frame 803 to P-frame 805, etc. In addition, there is a secondprediction path that skips over every other P-frame so half-frame ratetemporal scalability can be accomplished by predicting P-frames based onboth the first and second prediction paths. It will be appreciated thatother frame rate resolutions can be performed by changing the predictionpaths between the frames. It will be appreciated that the implementationdescribed in FIG. 8 can be used with a video stream that containsB-frames as well as P-frames (often collectively referred to as deltaframes) to achieve backwards temporal scalability.

FIG. 9 illustrates how the adaptive joint source channel coding may beimplemented with I and P (and/or B) video frames to provide randomaccess into a video stream. By providing a prediction path from I-frame901 to each P-frame 903, 905, 907, 909, the bit stream can be accessedat random points if the I-frame 901 is available. Similarly, in additionto forward random access, establishing prediction paths from futureI-frames will allow for backwards random access.

FIG. 10 illustrates the use of the adaptive joint source channel codingwithin the framework of a lifting scheme 1000 for discrete wavelettransformation. In the prior art, the previous frame 1001 is split 1003into two subsets and a prediction operation 1009 uses each of thesubsets to predict the corresponding subset (split 1007) in the currentframe 1005. The wavelet coefficient is the prediction error, i.e., thedifference 1013 between the predictor and the current data. An updateoperation 1015 is applied to the wavelet coefficients and the result isadded 1017 into the subset for the current frame to create scalingcoefficients. By inserting adaptive joint source channel coding 1011between the prediction operation 1009 and the difference operation 1013,the resulting the wavelets coefficients will be based on a decodingsphere that encompasses multiple predictors. When the split is on lowand high pass components, the use of adaptive joint source channelcoding allows for the correction of drift in the low pass components.The lifting scheme 1000 is particularly useful for encoder/decodermismatch and coding across GOPs (groups of pictures).

The following description of FIGS. 10A-B is intended to provide anoverview of computer hardware and other operating components suitablefor performing the methods of the invention described above, but is notintended to limit the applicable environments. One of skill in the artwill immediately appreciate that the embodiments of the invention can bepracticed with other computer system configurations, including hand-helddevices, multiprocessor systems, microprocessor-based or programmableconsumer electronics, network PCs, minicomputers, mainframe computers,and the like. The embodiments of the invention can also be practiced indistributed computing environments where tasks are performed by remoteprocessing devices that are linked through a communications network,such as peer-to-peer network infrastructure.

FIG. 10A shows several computer systems 1 that are coupled togetherthrough a network 3, such as the Internet. The term “Internet” as usedherein refers to a network of networks which uses certain protocols,such as the TCP/IP protocol, and possibly other protocols such as thehypertext transfer protocol (HTTP) for hypertext markup language (HTML)documents that make up the World Wide Web (web). The physicalconnections of the Internet and the protocols and communicationprocedures of the Internet are well known to those of skill in the art.Access to the Internet 3 is typically provided by Internet serviceproviders (ISP), such as the ISPs 5 and 7. Users on client systems, suchas client computer systems 21, 25, 35, and 37 obtain access to theInternet through the Internet service providers, such as ISPs 5 and 7.Access to the Internet allows users of the client computer systems toexchange information, receive and send e-mails, and view documents, suchas documents which have been prepared in the HTML format. Thesedocuments are often provided by web servers, such as web server 9 whichis considered to be “on” the Internet. Often these web servers areprovided by the ISPs, such as ISP 5, although a computer system can beset up and connected to the Internet without that system being also anISP as is well known in the art.

The web server 9 is typically at least one computer system whichoperates as a server computer system and is configured to operate withthe protocols of the World Wide Web and is coupled to the Internet.Optionally, the web server 9 can be part of an ISP which provides accessto the Internet for client systems. The web server 9 is shown coupled tothe server computer system 11 which itself is coupled to web content 10,which can be considered a form of a media database. It will beappreciated that while two computer systems 9 and 11 are shown in FIG.10A, the web server system 9 and the server computer system 11 can beone computer system having different software components providing theweb server functionality and the server functionality provided by theserver computer system 11 which will be described further below.

Client computer systems 21, 25, 35, and 37 can each, with theappropriate web browsing software, view HTML pages provided by the webserver 9. The ISP 5 provides Internet connectivity to the clientcomputer system 21 through the modem interface 23 which can beconsidered part of the client computer system 21. The client computersystem can be a personal computer system, a network computer, a Web TVsystem, a handheld device, or other such computer system. Similarly, theISP 7 provides Internet connectivity for client systems 25, 35, and 37,although as shown in FIG. 10A, the connections are not the same forthese three computer systems. Client computer system 25 is coupledthrough a modem interface 27 while client computer systems 35 and 37 arepart of a LAN. While FIG. 10A shows the interfaces 23 and 27 asgenerically as a “modem,” it will be appreciated that each of theseinterfaces can be an analog modem, ISDN modem, cable modem, satellitetransmission interface, or other interfaces for coupling a computersystem to other computer systems. Client computer systems 35 and 37 arecoupled to a LAN 33 through network interfaces 39 and 41, which can beEthernet network or other network interfaces. The LAN 33 is also coupledto a gateway computer system 31 which can provide firewall and otherInternet related services for the local area network. This gatewaycomputer system 31 is coupled to the ISP 7 to provide Internetconnectivity to the client computer systems 35 and 37. The gatewaycomputer system 31 can be a conventional server computer system. Also,the web server system 9 can be a conventional server computer system.

Alternatively, as well-known, a server computer system 43 can bedirectly coupled to the LAN 33 through a network interface 45 to providefiles 47 and other services to the clients 35, 37, without the need toconnect to the Internet through the gateway system 31. Furthermore, anycombination of client systems 21, 25, 35, 37 may be connected togetherin a peer-to-peer network using LAN 33, Internet 3 or a combination as acommunications medium. Generally, a peer-to-peer network distributesdata across a network of multiple machines for storage and retrievalwithout the use of a central server or servers. Thus, each peer networknode may incorporate the functions of both the client and the serverdescribed above.

FIG. 10B shows one example of a conventional computer system that can beused as a client computer system or a server computer system or as a webserver system. It will also be appreciated that such a computer systemcan be used to perform many of the functions of an Internet serviceprovider, such as ISP 5. The computer system 51 interfaces to externalsystems through the modem or network interface 53. It will beappreciated that the modem or network interface 53 can be considered tobe part of the computer system 51. This interface 53 can be an analogmodem, ISDN modem, cable modem, token ring interface, satellitetransmission interface, or other interfaces for coupling a computersystem to other computer systems. The computer system 51 includes aprocessing unit 55, which can be a conventional microprocessor such asan Intel Pentium microprocessor or Motorola Power PC microprocessor.Memory 59 is coupled to the processor 55 by a bus 57. Memory 59 can bedynamic random access memory (DRAM) and can also include static RAM(SRAM). The bus 57 couples the processor 55 to the memory 59 and also tonon-volatile storage 65 and to display controller 61 and to theinput/output (I/O) controller 67. The display controller 61 controls inthe conventional manner a display on a display device 63 which can be acathode ray tube (CRT) or liquid crystal display (LCD). The input/outputdevices 69 can include a keyboard, disk drives, printers, a scanner, andother input and output devices, including a mouse or other pointingdevice. The display controller 61 and the I/O controller 67 can beimplemented with conventional well known technology. A digital imageinput device 71 can be a digital camera which is coupled to an I/Ocontroller 67 in order to allow images from the digital camera to beinput into the computer system 51. The non-volatile storage 65 is oftena magnetic hard disk, an optical disk, or another form of storage forlarge amounts of data. Some of this data is often written, by a directmemory access process, into memory 59 during execution of software inthe computer system 51. One of skill in the art will immediatelyrecognize that the terms “computer-readable medium” and“machine-readable medium” include any type of storage device that isaccessible by the processor 55 and also encompass a carrier wave thatencodes a data signal.

It will be appreciated that the computer system 51 is one example ofmany possible computer systems which have different architectures. Forexample, personal computers based on an Intel microprocessor often havemultiple buses, one of which can be an input/output (I/O) bus for theperipherals and one that directly connects the processor 55 and thememory 59 (often referred to as a memory bus). The buses are connectedtogether through bridge components that perform any necessarytranslation due to differing bus protocols.

Network computers are another type of computer system that can be usedwith the embodiments of the present invention. Network computers do notusually include a hard disk or other mass storage, and the executableprograms are loaded from a network connection into the memory 59 forexecution by the processor 55. A Web TV system, which is known in theart, is also considered to be a computer system according to theembodiments of the present invention, but it may lack some of thefeatures shown in FIG. 10B, such as certain input or output devices. Atypical computer system will usually include at least a processor,memory, and a bus coupling the memory to the processor.

It will also be appreciated that the computer system 51 is controlled byoperating system software which includes a file management system, suchas a disk operating system, which is part of the operating systemsoftware. One example of an operating system software with itsassociated file management system software is the family of operatingsystems known as Windows® from Microsoft Corporation of Redmond, Wash.,and their associated file management systems. The file management systemis typically stored in the non-volatile storage 65 and causes theprocessor 55 to execute the various acts required by the operatingsystem to input and output data and to store data in memory, includingstoring files on the non-volatile storage 65.

Adaptive joint source channel coding has been described. Although theinvention as been described with reference to specific embodimentsillustrated herein, this description is not intended to be construed ina limiting sense. It will be appreciated by those of ordinary skill inthe art that any arrangement which is calculated to achieve the samepurpose may be substituted for the specific embodiments shown and isdeemed to lie within the scope of the invention. Accordingly, thisapplication is intended to cover any such adaptations or variations ofthe present invention. Therefore, it is manifestly intended that thisinvention be limited only by the following claims and equivalentsthereof.

1. A computerized method comprising: selecting multiple predictors for areference unit of correlated data; determining a sub-codebook in whicheach of the predictors decodes to the reference unit; and transmittingan identifier for the sub-codebook to decode the reference unit from oneof the predictors.
 2. The computerized method of claim 1 furthercomprising: transmitting the reference unit.
 3. The computerized methodof claim 1, wherein the identifier is a compressed representation of thereference unit.
 4. The computerized method of claim 1, wherein themultiple predictors are contained within a decoding region and theidentifier for the sub-codebook specifies the decoding region.
 5. Thecomputerized method of claim 4, wherein the decoding region is definedwithin an n-dimensional coefficient space.
 6. The computerized method ofclaim 1, wherein determining a sub-codebook comprises: partitioning acodebook until the sub-codebook is created.
 7. The computerized methodof claim 6, wherein the codebook comprises lattice partitions.
 8. Thecomputerized method of claim 1 further comprising: determining that noneof the multiple predictors were correctly received for decoding;selecting an additional predictor; and determining a new sub-codebookthat decodes the additional predictor to the reference frame.
 9. Thecomputerized method of claim 8 further comprising: sending an additionalidentifier for the new sub-codebook.
 10. The computerized method ofclaim 9, wherein the additional identifier combines with the identifierfor the sub-codebook to identify the new sub-codebook.
 11. Thecomputerized method of claim 1, wherein the predictors are selectedbased on a maximum error calculation.
 12. The computerized method ofclaim 1, wherein the reference unit is a frame in a video stream and thepredictors are selected from past and future frames in the video stream.13. The computerized method of claim 1, wherein the reference unit is aframe in a first video stream and the predictors are selected fromframes in the first video stream and frames in a second video stream.14. The computerized method of claim 1, wherein the reference unit is aframe in a first channel and the predictors are selected from frames inthe first channel and frames in a second channel.
 15. The computerizedmethod of claim 1, wherein the reference unit is a frame at a firstresolution and the predictors are selected from frames at a secondresolution.
 16. The computerized method of claim 1, wherein thereference unit is a delta frame in a video stream and the predictors areselected from an intraframe and other delta frames.
 17. The computerizedmethod of claim 1, wherein the reference unit is a delta frame in avideo stream and one of the predictors is an intraframe.
 18. Thecomputerized method of claim 1, wherein the identifier is used in placeof a prediction error in a lifting scheme for discrete wavelettransformation.
 19. The computerized method of claim 1 furthercomprising: receiving the identifier; and decoding the reference unitfrom a correctly received predictor using the sub-codebook identified bythe identifier.
 20. The computerized method of claim 1 furthercomprising: estimating the predictors if no predictors are correctlyreceived; and decoding the reference unit from a weighted combination ofthe estimated predictors using the sub-codebook identified by theidentifier.
 21. The computerized method of claim 1 further comprising:receiving an additional identifier for a new sub-codebook; and decodingthe reference unit from an additional predictor and the newsub-codebook.
 22. The computerized method of claim 1 further comprising:determining erroneous predictors based on decoding a forbidden symbol ina stream of units encoded using arithmetic coding.
 23. The computerizedmethod of claim 22, wherein the erroneous predictors are determinedaccording to 1/ε, where ε represents a probability that the forbiddensymbol will occur in the stream.
 24. A computerized method comprising:receiving an identifier corresponding to a sub-codebook in which each ofmultiple predictors decodes to a reference unit; and decoding thereference unit from one correctly received predictor using thesub-codebook identified by the identifier.
 25. The computerized methodof claim 24 further comprising: estimating the predictors if nopredictors are correctly received; and decoding the reference unit froma weighted combination of the estimated predictors using thesub-codebook identified by the identifier.
 26. The computerized methodof claim 24 further comprising: receiving an identifier for a newsub-codebook; and decoding the reference unit from an additionalpredictor and the new sub-codebook.
 27. A machine-readable medium havinginstructions to cause a processor to execute a method comprising:selecting multiple predictors for a reference unit of correlated data;determining a sub-codebook in which each of the predictors decodes tothe reference unit; and transmitting an identifier for the sub-codebookto decode the reference unit from one of the predictors.
 28. Themachine-readable medium of claim 27, wherein the method furthercomprises: transmitting the reference unit.
 29. The machine-readablemedium of claim 27, wherein the identifier is a compressedrepresentation of the reference unit.
 30. The machine-readable medium ofclaim 27, wherein the multiple predictors are contained within adecoding region and the identifier for the sub-codebook specifies thedecoding region.
 31. The machine-readable medium of claim 30, whereinthe decoding region is defined within an n-dimensional coefficientspace.
 32. The machine-readable medium of claim 27, wherein determininga sub-codebook comprises: partitioning a codebook until the sub-codebookis created.
 33. The machine-readable medium of claim 32, wherein thecodebook comprises lattice partitions.
 34. The machine-readable mediumof claim 27, wherein the method further comprises: determining that noneof the multiple predictors were correctly received for decoding;selecting an additional predictor; and determining a new sub-codebookthat decodes the additional predictor to the reference frame.
 35. Themachine-readable medium of claim 34, wherein the method furthercomprises: sending an additional identifier for the new sub-codebook.36. The machine-readable medium of claim 35, wherein the additionalidentifier combines with the identifier for the sub-codebook to identifythe new sub-codebook.
 37. The machine-readable medium of claim 27,wherein the predictors are selected based on a maximum errorcalculation.
 38. The machine-readable medium of claim 27, wherein themethod further comprises: receiving the identifier; and decoding thereference unit from a correctly received predictor using thesub-codebook identified by the identifier.
 39. The machine-readablemedium of claim 27, wherein the method further comprises: estimating thepredictors if no predictors are correctly received; and decoding thereference unit from a weighted combination of the estimated predictorsusing the sub-codebook identified by the identifier.
 40. Themachine-readable medium of claim 27, wherein the method furthercomprises: receiving an additional identifier for a new sub-codebook;and decoding the reference unit from an additional predictor and the newsub-codebook.
 41. A machine readable medium having instructions to causea processor to execute a method comprising: receiving an identifiercorresponding to a sub-codebook in which each of multiple predictorsdecodes to a reference unit; and decoding the reference unit from onecorrectly received predictor using the sub-codebook identified by theidentifier.
 42. The machine medium of claim 41, wherein the methodfurther comprises: estimating the predictors if no predictors arecorrectly received; and decoding the reference unit from a weightedcombination of the estimated predictors using the sub-codebookidentified by the identifier.
 43. The machine medium of claim 41,wherein the method further comprises: receiving an additional identifierfor a new sub-codebook; and decoding the reference unit from anadditional predictor and the new sub-codebook.
 44. A system comprising:a processor coupled to a memory through a bus; and an encoding processexecuted by the processor from the memory to cause the processor toselect multiple predictors for a reference unit of correlated data,determine a sub-codebook in which each of the predictors decodes to thereference unit, and transmit an identifier for the sub-codebook todecode the reference unit from one of the predictors.
 45. The system ofclaim 44, wherein the encoding process further causes the processor totransmit the reference unit.
 46. The system of claim 44, wherein theidentifier is a compressed representation of the reference unit.
 47. Thesystem of claim 44, wherein the multiple predictors are contained withina decoding region and the identifier for the sub-codebook specifies thedecoding region.
 48. The system of claim 47, wherein the decoding regionis defined within an n-dimensional coefficient space.
 49. The system ofclaim 44, wherein the encoding process further causes the processor topartition a codebook until the sub-codebook is created when determininga sub-codebook.
 50. The system of claim 49, wherein the codebookcomprises lattice partitions.
 51. The system of claim 44, wherein theencoding process further causes the processor to determine that none ofthe multiple predictors were correctly received for decoding, select anadditional predictor, and determine a new sub-codebook that decodes theadditional predictor to the reference frame.
 52. The system of claim 51,wherein the encoding process further causes the processor to send anadditional identifier for the new sub-codebook.
 53. The system of claim52, wherein the additional identifier combines with the identifier forthe sub-codebook to identify the new sub-codebook.
 54. The system ofclaim 44, wherein the predictors are selected based on a maximum errorcalculation.
 55. A system comprising: a processor coupled to a memorythrough a bus; and a decoding process executed from the memory by theprocessor to cause the processor to receive an identifier correspond toa sub-codebook in which each of multiple predictors decodes to areference unit, and decode the reference unit from one correctlyreceived predictor us the sub-codebook identified by the identifier. 56.The system of claim 55, wherein the decoding process further causes theprocessor to estimate the predictors if no predictors are correctlyreceived, and decode the reference unit from a weighted combination ofthe estimated predictors using the sub-codebook identified by theidentifier.
 57. The system of claim 55, wherein the decoding processfurther causes the processor to receive an additional identifier for anew sub-codebook, and decode the reference unit from an additionalpredictor and the new sub-codebook.
 58. An apparatus comprising: meansfor selecting multiple predictors for a reference unit of correlateddata; means for determining a sub-codebook in which each of thepredictors decodes to the reference unit; and means for transmitting anidentifier for the sub-codebook to decode the reference unit from one ofthe predictors.
 59. The apparatus of claim 58 further comprising: meansfor transmitting the reference unit.
 60. The apparatus of claim 58,wherein the identifier is a compressed representation of the referenceunit.
 61. The apparatus of claim 58, wherein the multiple predictors arecontained within a decoding region and the identifier for thesub-codebook specifies the decoding region.
 62. The apparatus of claim61, wherein the decoding region is defined within an n-dimensionalcoefficient space.
 63. The apparatus of claim 58, wherein the means fordetermining a sub-codebook comprises: means for partitioning a codebookuntil the sub-codebook is created.
 64. The apparatus of claim 63,wherein the codebook comprises lattice partitions.
 65. The apparatus ofclaim 58 further comprising: means for determining that none of themultiple predictors were correctly received for decoding; means forselecting an additional predictor; and means for determining a newsub-codebook that decodes the additional predictor to the referenceframe.
 66. The apparatus of claim 65 further comprising: means forsending an additional identifier for the new sub-codebook.
 67. Theapparatus of claim 66, wherein the additional identifier combines withthe identifier for the sub-codebook to identify the new sub-codebook.68. The apparatus of claim 58, wherein the predictors are selected basedon a maximum error calculation.
 69. An apparatus comprising: means forreceiving an identifier corresponding to a sub-codebook in which each ofmultiple predictors decodes to a reference unit; and means for decodingthe reference unit from one correctly received predictor using thesub-codebook identified by the identifier.
 70. The apparatus of claim 69further comprising: means for estimating the predictors if no predictorsare correctly received; and means for decoding the reference unit from aweighted combination of the estimated predictors using the sub-codebookidentified by the identifier.
 71. The apparatus of claim 69 furthercomprising: means for receiving an additional identifier for a newsub-codebook; and means for decoding the reference unit from anadditional predictor and the new sub-codebook.